A saddle-point approach to the Monge-Kantorovich optimal transport problem

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A saddle-point approach to the Monge-Kantorovich optimal transport problem

The Monge-Kantorovich problem is revisited by means of a variant of the saddle-point method without appealing to c-conjugates. A new abstract characterization of the optimal plans is obtained in the case where the cost function takes infinite values. It leads us to new explicit sufficient and necessary optimality conditions. As by-products, we obtain a new proof of the well-known Kantorovich du...

متن کامل

Optimal Transport Maps in Monge-Kantorovich Problem

In the first part of the paper we briefly decribe the classical problem, raised by Monge in 1781, of optimal transportation of mass. We discuss also Kantorovich’s weak solution of the problem, which leads to general existence results, to a dual formulation, and to necessary and sufficient optimality conditions. In the second part we describe some recent progress on the problem of the existence ...

متن کامل

Characterization of Optimal Transport Plans for the Monge-kantorovich-problem

We prove that c-cyclically monotone transport plans π optimize the Monge-Kantorovich transportation problem under an additional measurability condition. This measurability condition is always satisfied for finitely valued, lower semi-continuous cost functions. In particular, this yields a positive answer to Problem 2.25 in C. Villani’s book. We emphasize that we do not need any regularity condi...

متن کامل

Monge–Kantorovich transportation problem and optimal couplings

• Mathematics Subject Classification: 60E15, 90C40, 49N15 •

متن کامل

A generalized dual maximizer for the Monge–Kantorovich transport problem

The dual attainment of the Monge–Kantorovich transport problem is analyzed in a general setting. The spaces X,Y are assumed to be polish and equipped with Borel probability measures μ and ν. The transport cost function c : X × Y → [0,∞] is assumed to be Borel measurable. We show that a dual optimizer always exists, provided we interpret it as a projective limit of certain finitely additive meas...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ESAIM: Control, Optimisation and Calculus of Variations

سال: 2010

ISSN: 1292-8119,1262-3377

DOI: 10.1051/cocv/2010013